Sequences with constant number of return words

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sequences with constant number of return words

An infinite word has the property Rm if every factor has exactly m return words. Vuillon showed that R2 characterizes Sturmian words. We prove that a word satisfies Rm if its complexity function is (m − 1)n + 1 and if it contains no weak bispecial factor. These conditions are necessary for m = 3, whereas for m = 4 the complexity function need not be 3n + 1. A new class of words satisfying Rm is...

متن کامل

A characterization of substitutive sequences using return words

We prove that a sequence is primitive substitutive if and only if the set of its derived sequences is finite; we defined these sequences here.

متن کامل

Return Words in the Thue-morse and Other Sequences

We present three simple ideas which enable to determine easily the number of return words in some infinite words. Using these ideas, we give a new and very short proof of the fact that each factor of an Arnoux-Rauzy word of order m has exactly m return words. We describe the structure of return words for the Thue-Morse sequence and focus on infinite words which are associated to simple Parry nu...

متن کامل

On the number of return words in infinite words constructed by interval exchange transformations

In this article, we count the number of return words in some infinite words with complexity 2n + 1. We also consider some infinite words given by codings of rotation and interval exchange transformations on k intervals. We prove that the number of return words over a given word w for these infinite words is exactly k. Mathematics Subject Classifications (2000). 37E05, 68R15

متن کامل

Return words in Sturmian and episturmian words

Considering each occurrence of a word w in a recurrent infinite word, we define the set of return words of w to be the set of all distinct words beginning with an occurrence of w and ending exactly just before the next occurrence of w in the infinite word. We give a simpler proof of the recent result (of the second author) that an infinite word is Sturmian if and only if each of its factors has...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Monatshefte für Mathematik

سال: 2008

ISSN: 0026-9255,1436-5081

DOI: 10.1007/s00605-008-0001-2